Fault Localization Based on Hybrid Genetic Simulated Annealing Algorithm
نویسندگان
چکیده
Software testing is an important stage in the software development process, which key to ensure quality and improve reliability. fault localization most part of testing. In this paper, problem modeled as a combinatorial optimization problem, using function call path starting point. A heuristic search algorithm based on hybrid genetic simulated annealing used locate defects. Experimental results show that method, combines algorithm, correlation analysis has good effect single multi-fault localization. It greatly reduces requirement test case coverage burden testers, improves
منابع مشابه
A New Hybrid Routing Algorithm based on Genetic Algorithm and Simulated Annealing for Vehicular Ad hoc Networks
In recent years, Vehicular Ad-hoc Networks (VANET) as an emerging technology have tried to reduce road damage and car accidents through intelligent traffic controlling. In these networks, the rapid movement of vehicles, topology dynamics, and the limitations of network resources engender critical challenges in the routing process. Therefore, providing a stable and reliable routing algorithm is ...
متن کاملAn Integrated Model of Project Scheduling and Material Ordering: A Hybrid Simulated Annealing and Genetic Algorithm
This study aims to deal with a more realistic combined problem of project scheduling and material ordering. The goal is to minimize the total material holding and ordering costs by determining the starting time of activities along with material ordering schedules subject to some constraints. The problem is first mathematically modelled. Then a hybrid simulated annealing and genetic algorithm is...
متن کاملHybrid Architecture of Genetic Algorithm and Simulated Annealing
achieves the searching not only globally, but also locally. To keep general purpose, self-control processing by a handshake system is introduced. By adopting the handshake system, the proposed architecture can be applied to various combinatorial optimization problems by only changing an encoder, a decoder, and an evaluation circuit. Furthermore, the proposed architecture realizes flexibility fo...
متن کاملA research into location routing problem based on hybrid genetic simulated annealing algorithm
With the diversified and personalized commodity requirements as well as small batch dispatch and frequent dispatch features under the circumstance of E-commerce, the environment for logistics dispatching system becomes increasingly complicated and the interinfluence between different subsystems in logistics system optimization becomes increasingly significant. As a result, judged from the aspec...
متن کاملHybrid Genetic Algorithm with Simulated Annealing based on Best-Fit Strategy for Rectangular Packing Problem
In this paper we address a rectangular packing problem (RPP), which is one of the most difficult NP-complete problems. Borrowing from the respective advantages of the two algorithms, a hybrid of genetic algorithm (GA) and simulated annealing (SA) is developed to solve the RPP. Firstly, we adopt and improve Burke’s best-fit (BF) placement strategy, which is not restricted to the first shape but ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computing and Information Technology
سال: 2021
ISSN: ['1846-3908', '1330-1136']
DOI: https://doi.org/10.20532/cit.2020.1005134